Automated Runtime Verification with Eagle
نویسندگان
چکیده
EAGLE is a very powerful logic for expressing behavioral properties about systems that evolve over time. Specifically, the logic can be used to monitor the execution of computer programs. EAGLE is an extension of propositional logic with three temporal kernel operators, with recursion, and with parameterization over formulas in the logic as well as over data values. Formula parameterization allows the user to define new temporal combinators. Data parameterization allows to define properties relating data values from different points in time. A wide range of different notations can be defined on top of EAGLE using these mechanisms, such as future and past time linear temporal logic, extended regular expressions, real-time logics, interval logics, forms of quantified temporal logics, and so on. EAGLE is implemented as a Java library. Monitoring is done on a stateby-state basis, without storing the execution trace. In this paper we demonstrate the logic on an event-based component model of a bounded priority queue.
منابع مشابه
Calculus-based Runtime Verification
In this paper, a uniform calculus-based approach for synthesizing monitors checking correctness properties specified by a large variety of logics at runtime is provided, including future and past time logics, interval logics, state machine and parameterized temporal logics. We present a calculus mechanism to synthesize monitors from the logical specification for the incremental analysis of exec...
متن کاملRule Systems for Run-Time Monitoring: From Eagleto RuleR
Eagle was introduced as a general purpose rule-based temporal logic for specifying run-time monitors. A novel and relatively efficient interpretative trace-checking scheme via stepwise transformation of an Eagle monitoring formula was defined and implemented. However, application in real-world examples has shown efficiency weaknesses, especially those associated with large-scale symbolic formul...
متن کاملHypothesis-Based Approach To Detecting Runtime Violations In Java Program Using Automated Theorem Prover
We develop an approach to apply formal methods to represent the program source codes as a model, after that, using automated theorem prover to try to detect runtime violations in those codes by doing static analysis. Unlike other proof based program verification approaches, this approach is based on hypothesis to develop the formal specification information implied by source codes, such as inva...
متن کاملStaRVOOrS: A Tool for Combined Static and Runtime Verification of Java
We present the tool StaRVOOrS (Static and Runtime Verification of Object-Oriented Software), which combines static and runtime verification (RV) of Java programs. The tool automates a framework which uses partial results extracted from static verification to optimise the runtime monitoring process. StaRVOOrs combines the deductive theorem prover KeY and the RV tool LARVA, and uses properties wr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005